On Work of Barmpalias and Lewis-Pye: A Derivation on the D.C.E. Reals
نویسنده
چکیده
These are beautiful results that clarify the behavior of random left-c.e. reals. It has long been understood that all random left-c.e. reals are “essentially interchangeable”. One of the key arguments for this heuristic was given by Kučera and Slaman [8], who showed that, up to multiplicative constants, we cannot approximate one random leftc.e. real faster than another (see Lemma 1.1). The convergence of (1) shows more: all approximations to random left-c.e. reals converge in essentially the same way. This not only solidifies our belief that that random left-c.e. reals are interchangeable, but ironically, it gives us a useful way to contrast them. For example, it follows that Bα{Bβ ą 1 if and only if α ́ β is a random left-c.e. real and Bα{Bβ ă 1 if and only if α ́ β is a random right-c.e. real.
منابع مشابه
A Note on the Differences of Computably Enumerable Reals
We show that given any non-computable left-c.e. real α there exists a left-c.e. real β such that α , β + γ for all left-c.e. reals and all right-c.e. reals γ. The proof is non-uniform, the dichotomy being whether the given real α is Martin-Löf random or not. It follows that given any universal machine U, there is another universal machine V such that the halting probability ΩU of U is not a tra...
متن کاملDifferences of halting probabilities
The halting probabilities of universal prefix-free machines are universal for the class of reals with computably enumerable left cut (also known as left-c.e. reals), and coincide with the Martin-Löf random elements of this class. We study the differences of Martin-Löf random left-c.e. reals and show that for each pair of such reals α, β there exists a unique number r > 0 such that qα − β is a M...
متن کاملPointed computations and Martin-Löf randomness
Schnorr showed that a real X is Martin-Löf random if and only if K(X ↾n) ≥ n − c for some constant c and all n, where K denotes the prefix-free complexity function. Fortnow (unpublished) and Nies, Stephan and Terwijn [NST05] observed that the condition K(X ↾n) ≥ n− c can be replaced with K(X ↾rn ) ≥ rn − c, for any fixed increasing computable sequence (rn), in this characterization. The purpose...
متن کاملLower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers
The Kučera-Gács theorem [Kuč85, Gác86] is a landmark result in algorithmic randomness asserting that every real is computable from a Martin-Löf random real. If the computation of the first n bits of a sequence requires n + h(n) bits of the random oracle, then h is the redundancy of the computation. Kučera implicitly achieved redundancy n log n while Gács used a more elaborate coding procedure w...
متن کاملComputing halting probabilities from other halting probabilities
The halting probability of a Turing machine is the probability that the machine will halt if it starts with a random stream written on its one-way input tape. When the machine is universal, this probability is referred to as Chaitin’s omega number, and is the most well known example of a real which is random in the sense of Martin-Löf. Although omega numbers depend on the underlying universal T...
متن کامل